package LinkList02;

import java.util.concurrent.ConcurrentLinkedDeque;

// 1、无头单向非循环链表实现
public class SingleLinkedList {
    static class ListNode{
        public int val;
        public ListNode next;

        public ListNode(int val){
            this.val =  val;
        }
    }

    public ListNode head;
    //头插法
    public void addFirst(int data){
        ListNode cur =  new ListNode(data);
        cur.next = head;
        head = cur;
    }
    //尾插法
    public void addLast(int data){
        ListNode cur = head;
        ListNode node  = new ListNode(data);
        while (cur.next != null){
            cur = cur.next;
        }
        cur.next = node;
        node.next = null;
    }
    //任意位置插入,第一个数据节点为0号下标
    public boolean addIndex(int index,int data){
        //找到index的前一个节点的位置
        ListNode cur = head;
        while((index - 1) != 0){
            cur = cur.next;
            index--;
        }
        ListNode node = new ListNode(data);
        node.next = cur.next;
        cur.next =  node;
    }
    //查找是否包含关键字key是否在单链表当中
    public boolean contains(int key){
        ListNode cur = head;
        while(cur != null){
            if(cur.val == key){
                return true;
            }
            cur = cur.next;
        }
        return false;

    }
    //删除第一次出现关键字为key的节点
    public void remove(int key){
        ListNode cur = head;
        ListNode node = new ListNode(key);
        while(cur != null){
            if(cur.next.val == key){
                cur.next = node.next;
            }
        }
    }
    //删除所有值为key的节点
    public void removeAllKey(int key){

    }
    //得到单链表的长度
    public int size(){
        ListNode cur = head;
        int count = 0;
        while(cur != null){
            cur  = cur.next;
            count++;
        }
        return count;
    }
    public void display(){
        ListNode cur = head;
        while(cur != null){
            System.out.print( cur.val +" ");
            cur = cur.next;
        }
    }
    public void clear(){

    }
}